Bicriterion Shortest Path Problem with a General Nonadditive Cost

Shortest Path Problem with Gamma Probability Distribution Arc Length

We propose a dynamic program to find the shortest path in a network having gamma probability distributions as arc lengths. Two operators of sum and comparison need to be adapted for the proposed dynamic program. Convolution approach is used to sum two gamma probability distributions being employed in the dynamic program.

An Extended Shortest Path Problem with Switch Cost Between Arcs

Computing the shortest path in a graph is an important problem and it is very useful in various applications. The standard shortest path problem has been studied extensively and intensively, but it can’t handle the situation when there is a switch cost between arcs. For example, in a train transportation network, the switch cost between arcs contains waiting time in stations, times of transfer ...

A Geometric Shortest Path Problem , with Application

The shortest path problem

The shortest path problem is solved and applied to the calculations of half lives with respect to spontaneous fission of heavy nuclei. The dynamical programming method of Bellman and Kalaba is used to find the fission path in the d-dimensional space of deformation parameters. Fission half lives of heavy isotopes (100<Z<110) are shown and compared to the experimental data. 1. Introductory remark...

The Traffic Equilibrium Problem with Nonadditive Path Costs

In this paper we present a version of the (static) traac equilibrium problem in which the cost incurred on each path is not simply the sum of the costs on the arcs that constitute that path. We motivate this nonadditive version of the problem by describing several situations in which the classic additivity assumption fails. We describe existence and uniqueness conditions for this problem and we...